On super edge-magic deficiency of certain Toeplitz graphs

On the Super Edge-Magic Deficiency of Graphs

A (p,q) graph G is called super edge-magic if there exists a bijective function f from V (G) ∪ E(G) to {1, 2,. .. , p + q} such that f (x) + f (xy) + f (y) is a constant k for every edge xy of G and f (V (G)) = {1, 2,. .. , p}. Furthermore, the super edge-magic deficiency of a graph G is either the minimum nonnegative integer n such that G ∪ nK 1 is super edge-magic or +∞ if there exists no suc...

Further Results On Super Edge-Magic Deficiency Of Graphs

Acharya and Hegde have introduced the notion of strongly k-indexable graphs: A (p, q)-graph G is said to be strongly k-indexable if its vertices can be assigned distinct integers 0, 1, 2, ..., p − 1 so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices can be arranged as an arithmetic progression k, k+ 1, k + 2, ..., k + (q − 1). Such an assignment ...

Perfect super edge - magic graphs

In this paper we introduce the concept of perfect super edge-magic graphs and we prove some classes of graphs to be perfect super edge-magic.

On super edge-magic graphs which are weak magic

A (p,q) graph G is total edge-magic if there exits a bijection f: Vu E ~ {1.2,. .. ,p+q} such that for each e=(u,v) in E, we have feu) + fee) + f(v) as a constant. For a graph G, denote M(G) the set of all total edge-magic labelings. The magic strength of G is the minimum of all constants among all labelings in M(G), and denoted by emt(G). The maximum of all constants among M(G) is called the m...

On edge-magic labelings of certain disjoint unions of graphs